Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K
نویسندگان
چکیده
The goal of this paper is to propose a new technique for developing decision procedures for propositional modal logics. The basic idea is that propositional modal decision procedures should be developed on top of propositional decision procedures. As a case study, we describe an algorithm, based on an implementation of the Davis-Putnam-Longemann-Loveland procedure, which tests satissability in modal K. The algorithm is compared with a tableau based decision procedure. The experimental results show that our algorithm outperforms this system. The testing is performed following a newly developed methodology which, among other things, allows us to classify problems according to an easy to hard pattern.
منابع مشابه
Incremental Decision Procedures for Modal Logic with Nominals and Eventualities
This thesis contributes to the study of incremental decision procedures for modal logics with nominals and eventualities. Eventualities are constructs that allow to reason about the reflexive-transitive closure of relations. Eventualities are an essential feature of temporal logics and propositional dynamic logic (PDL). Nominals extend modal logics with the possibility to reason about state equ...
متن کاملResolution Is a Decision Procedure for Many Propositional Modal Logics
The paper shows satissability in many propositional modal systems, including K, KD, KT and KB, their combinations as well as their multi-modal versions, can be decided by ordinary resolution procedures. This follows from a general result that resolution and condensing is a decision procedure for the satissability problem of formulae in so-called path logics. Path logics arise from propositional...
متن کاملSAT-Based Decision Procedures for Normal Modal Logics: A Theoretical Framework
Tableau systems are very popular in AI for their simplicity and versatility. In recent papers we showed that tableau-based procedures are intrinsically ineecient, and proposed an alternative approach of building decision procedures on top of SAT decision procedure. We called this approach \SAT-based". In extensive empirical tests on the case study of modal K, a SAT-based procedure drastically o...
متن کاملResolution Is a Decision Procedure for Many Propositional Modal Logics (extended Abstract)
abstract. The paper shows satissability in many propositional modal systems, including K, KD, KT and KB, their combinations as well as their multi-modal versions, can be decided by ordinary resolution procedures. This follows from a general result that resolution and condensing is a decision procedure for the satissability problem of formulae in so-called path logics. Path logics arise from pro...
متن کاملPerformance of DLP on Random Modal Formulae
A system that correctly reasons with information in an expressive description logic includes a decision procedure for an expressive propositional modal logic. This decision procedure must be heavily optimised if it is to be able to usefully reason with knowledge bases of any complexity. Description logic systems that incorporate a heavily-optimised propositional modal logic decision procedure i...
متن کامل